An Improved Threshold Scheme Based on Modular ARithmetic
نویسندگان
چکیده
An efficient threshold scheme is proposed in this paper. It overcomes the weakness of Asmuth et al.s scheme. The (r, n)-threshold scheme proposed below only takes O(r) operations to recover the shared secret while Shamirs scheme takes O(rlogr) operations. We show that our scheme is perfect. Further, we also propose a method to generate a pairwise relatively prime integer set which satisfies the requirements of Asmuth et al.s and our schemes.
منابع مشابه
An Improved Modular Modeling for Analysis of Closed-Cycle Absorption Cooling Systems
A detailed modular modeling of an absorbent cooling system is presented in this paper. The model including the key components is described in terms of design parameters, inputs, control variables, and outputs. The model is used to simulate the operating conditions for estimating the behavior of individual components and system performance, and to conduct a sensitivity analysis based on the give...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملOptimizing Robustness While Generating Shared Secret Safe Primes
We develop a method for generating shared, secret, safe primes applicable to use in threshold RSA signature schemes such as the one developed by Shoup. We would like a scheme usable in practical settings, so our protocol is robust and efficient in asynchronous, hostile environments. We show that the techniques used for robustness need special care when they must be efficient. Specifically, we s...
متن کاملOn the design and security of a lattice-based threshold secret sharing scheme
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...
متن کاملAn improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 15 شماره
صفحات -
تاریخ انتشار 1999